- factorization theorem
- теорема о разложении (больших чисел) на простые множители, теорема факторизации
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
factorization theorem
Смотреть что такое "factorization theorem" в других словарях:
Weierstrass factorization theorem — In mathematics, the Weierstrass factorization theorem in complex analysis, named after Karl Weierstrass, asserts that entire functions can be represented by a product involving their zeroes. In addition, every sequence tending to infinity has an… … Wikipedia
Stinespring factorization theorem — In mathematics, Stinespring s dilation theorem, also called Stinespring s factorization theorem, is a result from operator theory that represents any completely positive map on a C* algebra as a composition of two completely positive maps each of … Wikipedia
Factorization — This article is about the mathematical concept. For other uses, see Factor and Integer factorization. A visual illustration of the polynomial x2 + cx + d = (x + a)(x + b) where… … Wikipedia
Factorization lemma — In measure theory, the factorization lemma allows us to express a function f with another function T if f is measurable with respect T . An application of this is regression analysis.TheoremLet T:Omega ightarrowOmega be a function of a set Omega… … Wikipedia
Fundamental theorem of arithmetic — In number theory, the fundamental theorem of arithmetic (or unique prime factorization theorem) states that every natural number greater than 1 can be written as a unique product of prime numbers. For instance, : 6936 = 2^3 imes 3 imes 17^2 , ,! … Wikipedia
Choi's theorem on completely positive maps — In mathematics, Choi s theorem on completely positive maps (after Man Duen Choi) is a result that classifies completely positive maps between finite dimensional (matrix) C* algebras. An infinite dimensional algebraic generalization of Choi s… … Wikipedia
Mittag-Leffler's theorem — In complex analysis, Mittag Leffler s theorem concerns the existence of meromorphic functions with prescribed poles. It is sister to the Weierstrass factorization theorem, which asserts existence of holomorphic functions with prescribed zeros. It … Wikipedia
Weierstrass theorem — Several theorems are named after Karl Weierstrass. These include: *The Weierstrass approximation theorem, also known as the Stone Weierstrauss theorem *The Bolzano Weierstrass theorem, which ensures compactness of closed and bounded sets in R n… … Wikipedia
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Lenstra elliptic curve factorization — The Lenstra elliptic curve factorization or the elliptic curve factorization method (ECM) is a fast, sub exponential running time algorithm for integer factorization which employs elliptic curves. Technically, the ECM is classified as a… … Wikipedia
